Bridge-Addability, Edge-Expansion and Connectivity
نویسندگان
چکیده
منابع مشابه
Edge Connectivity in Graphs: an Expansion Theorem
We show that if a graph is k-edge-connected, and we adjoin to it another graph satisfying a " contracted diameter ≤ 2 " condition, with minimal degree ≥ k, and some natural hypothesis on the edges connecting one graph to the other, the resulting graph is also k-edge-connected.
متن کاملEdge-connectivity and super edge-connectivity of P2-path graphs
For a graph G, the P2-path graph, P2(G), has for vertices the set of all paths of length 2 in G. Two vertices are connected when their union is a path or a cycle of length 3. We present lower bounds on the edge-connectivity, (P2(G)) of a connected graph G and give conditions for maximum connectivity. A maximally edge-connected graph is superif each minimum edge cut is trivial, and it is optimum...
متن کاملEdge-connectivity and edge-disjoint spanning trees
where the minimum is taken over all subsets X of E(G) such that ω(G − X) − c > 0. In this paper, we establish a relationship 7 between λc(G) and τc−1(G), which gives a characterization of the edge-connectivity of a graph G in terms of the spanning tree 8 packing number of subgraphs of G. The digraph analogue is also obtained. The main results are applied to show that if a graph G is 9 s-hamilto...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملDegree distance and edge-connectivity
Let G be a finite connected graph. The degree distance D′(G) of G is defined as ∑ {u,v}⊆V (G)(deg u + deg v) dG(u, v), where degw is the degree of vertex w and dG(u, v) denotes the distance between u and v in G. In this paper, we give asymptotically sharp upper bounds on the degree distance in terms of order and edge-connectivity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2017
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548317000128